Recounting partitions in memory of Freeman Dyson
Wladimir Pribitkin (College of Staten Island and CUNY Graduate Center)
Abstract: We shall present a short proof of Rademacher's famous formula for the partition function $p(n)$. Although the proof is old, its joint publication (with Brandon Williams) is not, and the communication that it engendered with Freeman Dyson is forever young. If time permits, we shall discuss a generalization to a broad class of functions.
number theory
Audience: researchers in the topic
Combinatorial and additive number theory (CANT 2021)
Series comments: This is the nineteenth in a series of annual workshops sponsored by the New York Number Theory Seminar on problems in combinatorial and additive number theory and related parts of mathematics.
Registration for the conference is free. Register at cant2021.eventbrite.com.
The conference website is www.theoryofnumbers.com/cant/ Lectures will be broadcast on Zoom. The Zoom login will be emailed daily to everyone who has registered on eventbrite. To join the meeting, you may need to download the free software from www.zoom.us.
The conference program, list of speakers, and abstracts are posted on the external website.
| Organizer: | Mel Nathanson* |
| *contact for this listing |